Models of computation - PDFSEARCH.IO - Document Search Engine

Models of computation
Results: 1716

#	Item
951	The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastian Maneth2,[removed]The University of Tokyo, [removed] Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2009-11-17 09:02:22 Computer science Turing machine Binary tree Non-deterministic Turing machine Symbol Computation tree Finite-state machine Theoretical computer science Automata theory Models of computation
952	Implementation and Indeterminacy Curtis Brown Department of Philosophy Trinity University One Trinity Place, San Antonio, TX 78212, USA [removed] Add to Reading List Source URL: crpit.com Language: English - Date: 2012-01-19 01:27:36 Computer science Computability theory Turing machine Computability Computable function Algorithm Register machine Abstract machine Finite-state machine Theoretical computer science Theory of computation Models of computation
953	The Complexity of Tree Transducer Output Languages FSTTCS 2008, Bengaluru Kazuhiro Inaba Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2009-06-23 09:15:01 Models of computation Finite-state machine Regular language DSPACE Finite state transducer Theoretical computer science Automata theory Formal languages
954	CHAPTER THREE PERCEPTION AND COMPUTATION In this chapter we indicate how the class of observers properly contains the class of Turing machines. We discuss the simulation of observers by Turing Add to Reading List Source URL: www.cogsci.uci.edu Language: English - Date: 2002-07-26 13:45:30 Theory of computation Computer science Models of computation Formal methods Alan Turing Symbol Computable function Turing machine Turing degree Computability theory Theoretical computer science Mathematics
955	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
956	Reliability of Technical Systems Advanced Methods for Systems Modelling and Simulation I : Petri Nets Petri Nets - Overview  Introduction Add to Reading List Source URL: www.lsa.ethz.ch Language: English - Date: 2010-11-25 08:50:54 Formal methods Petri nets Computer science Software engineering Algebraic Petri nets Event-driven Petri net Models of computation Concurrency Diagrams
957	¨ t Augsburg Universita Formal Verification of Information Flow Secure Systems with IFlow Add to Reading List Source URL: www.isse.uni-augsburg.de Language: English - Date: 2014-12-01 09:12:56 Software engineering Design Diagrams Automata theory Models of computation Class diagram Stereotype Activity diagram Sequence diagram UML diagrams Unified Modeling Language Data modeling
958	Foundations of Software Technology and Theoretical Computer Science (Bangalore[removed]Editors: R. Hariharan, M. Mukund, V. Vinay; pp[removed]The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastia Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2009-11-17 09:02:18 Computer science Binary tree Computation tree Symbol Finite-state machine Non-deterministic Turing machine Automata theory Theoretical computer science Models of computation
959	A paradox related to the Turing Test Samuel A. Alexander∗ Department of Mathematics, the Ohio State University Published in The Reasoner vol. 5, issue 6, p. 90. I will describe a paradox which arises assuming it is pos Add to Reading List Source URL: www.semitrivial.com Language: English - Date: 2012-07-26 20:25:00 Computer science Alan Turing Formal methods Models of computation Computable function Turing machine Computability Turing test Computable number Computability theory Theoretical computer science Theory of computation
960	ISSN[removed]Overload Journal of the ACCU C++ Special Interest Group Issue 24 Add to Reading List Source URL: accu.org Language: English - Date: 2010-10-21 16:24:02 Infographics Software engineering Information science Communication design Automata theory State diagram Finite-state machine Unified Modeling Language Event UML diagrams Models of computation Diagrams

UPDATE